package practice1_100;

import java.util.List;

public class Practice95 {
    public List<TreeNode> generateTrees(int n) {
        int num[]=new int[n];
        for (int i = 0; i < num.length ; i++) {
            num[i]=i+1;
        }
        for (int i = 1; i <=n ; i++) {
            //建立二叉树
            bulid(num,i);
        }
        return null;
    }

    private void bulid(int[] num, int i) {
    }
}
